The Cut

The Taming of the Cut. Classical Refutations with Analytic Cut

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

Maximum Cut Problem, MAX-CUT

The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...

LM-Cut: Optimal Planning with the Landmark-Cut Heuristic∗

The LM-Cut planner uses the landmark-cut heuristic, introduced by the authors in 2009, within a standard A∗ progression search framework to find optimal sequential plans for STRIPS-style planning tasks. This short paper recapitulates the main ideas surrounding the landmark-cut heuristic and provides pointers for further reading.

Making the cut.

t was conceived after a yogurt company in 2007 identified an unexpected defense mechanism that its bacteria use to fight off viruses. A birth announcement came in 2012, followed by crucial first steps in 2013 and a massive growth spurt last year. Now, it has matured into a molecular marvel, and much of the world—not just biologists—is taking notice of the genome-editing method CRISPR, Science’s...